Sparse Planar Array Synthesis Using Matrix Enhancement and Matrix Pencil
نویسندگان
چکیده
منابع مشابه
Estimating two-dimensional frequencies by matrix enhancement and matrix pencil
A new method, called the matrix enhancement and matrix pencil (MEMP) method, is presented for estimating twodimensional (2-D) frequencies. The MEMP method first constructs an enhanced matrix from the data samples, and then uses the matrix pencil approach to extract out the 2-D sinusoids from the principal eigenvectors of the enhanced matrix. The MEMP method yields the estimates of the 2-D frequ...
متن کاملEfficient Sparse Matrix-matrix Products Using Colorings
Sparse matrix-matrix products appear in multigrid solvers and computational methods for graph theory. Some formulations of these products require the inner product of two sparse vectors, which have inefficient use of cache memory. In this paper, we propose a new algorithm for computing sparse matrix-matrix products by exploiting matrix nonzero structure through the process of graph coloring. We...
متن کاملBeampattern Synthesis with Linear Matrix Inequalities Using Minimum Array Sensors
A new beampattern synthesis formulation is proposed to compute the minimum number of array sensors required. In order to satisfy all the prescribed specifications of the beampattern, the proposed method imposes linear matrix inequality (LMI) constraints on the beampattern as developed by Davidson et al., which remove the need to discretize the beampattern region. As the proposed formulation is ...
متن کاملSparse Matrix Multiplication Using UPC
Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide, they make distributing data and operating on ghost zones relatively easy. Meanwhile, they provide thread-data affinity that can enable locality exploitation. In this paper, we are considering sparse matrix multiplicatio...
متن کاملSparse Matrix-Vector Multiplication on a Small Linear Array
A data-driven algorithm to compute a matrix-vector product on a linear array of processing elements is presented. This algorithm is based on an eecient construction that covers the nonzero entries of the matrix with staircases. The number of processing elements required equals the size of a minimal staircase cover of the matrix. The algorithm is shown to be superior to the algorithm of Melhem i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Antennas and Propagation
سال: 2013
ISSN: 1687-5869,1687-5877
DOI: 10.1155/2013/147097